On Bondage Numbers of Graphs: A Survey with Some Comments

The domination number of a graph G is the smallest number of vertices which dominate all remaining vertices by edges of G. The bondage number of a nonempty graphG is the smallest number of edges whose removal fromG results in a graph with domination number greater than the domination number of G. The concept of the bondage number was formally introduced by Fink et al. in 1990. Since then, this topic has received considerable research attention and made some progress, variations, and generalizations. This paper gives a survey on the bondage number, including known results, conjectures, problems, and some comments, also selectively summarizes other types of bondage numbers.